Weakening the Axiom of Overlap in Infinitary Lambda Calculus
نویسندگان
چکیده
In this paper we present a set of necessary and sufficient conditions on a set of lambda terms to serve as the set of meaningless terms in an infinitary bottom extension of lambda calculus. So far only a set of sufficient conditions was known for choosing a suitable set of meaningless terms to make this construction produce confluent extensions. The conditions covered the three main known examples of sets of meaningless terms. However, the much later construction of many more examples of sets of meaningless terms satisfying the sufficient conditions renewed the interest in the necessity question and led us to reconsider the old conditions. The key idea in this paper is an alternative solution for solving the overlap between beta reduction and bottom reduction. This allows us to reformulate the Axiom of Overlap, which now determines together with the other conditions a larger class of sets of meaningless terms. We show that the reformulated conditions are not only sufficient but also necessary for obtaining a confluent and normalizing infinitary lambda beta bottom calculus. As an interesting consequence of the necessity proof we obtain for infinitary lambda calculus with beta and bot reduction that confluence implies normalization. 1998 ACM Subject Classification F.4.1 Mathematical Logic (F.1.1, I.2.2, I.2.3, I.2.4)
منابع مشابه
The infinitary lambda calculus of the infinite eta Böhm trees
In this paper, we introduce a strong form of eta reduction called etabang that we use to construct a confluent and normalising infinitary lambda calculus, of which the normal forms correspond to Barendregt’s infinite eta Böhm trees. This new infinitary perspective on the set of infinite eta Böhm trees allows us to prove that the set of infinite eta Böhm trees is a model of the lambda calculus. ...
متن کاملA Coinductive Confluence Proof for Infinitary Lambda-Calculus
We present a new coinductive proof of confluence of Böhm reduction in infinitary lambda-calculus. The proof is simpler than previous proofs of this result. The technique of the proof is new, i.e., it is not merely a coinductive reformulation of any earlier proofs.
متن کاملInfinitary Intersection Types as Sequences: a New Answer to Klop's Question
We provide a type-theoretical characterization of weakly-normalizing terms in an infinitary lambda-calculus. We adapt for this purpose the standard quantitative (with non-idempotent intersections) type assignment system of the lambda-calculus to our infinite calculus. Our work provides a new answer to Klop’s HHN-problem, namely, finding out if there is a type system characterizing the hereditar...
متن کاملInfinitary $\lambda$-Calculi from a Linear Perspective (Long Version)
We introduce a linear infinitary λ-calculus, called `Λ∞, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted coinductively. The obtained calculus embeds the infinitary applicative λ-calculus and is universal for computations over infinite strings. What is particularly interesting about `Λ∞, is that the re...
متن کاملOn Bar Recursion and Choice in a Classical Setting
We show how Modified Bar-Recursion, a variant of Spector’sBar-Recursion due to Berger and Oliva can be used to realize the Axiomof Choice in Parigot’s Lambda-Mu-calculus, a direct-style language forthe representation and evaluation of classical proofs.We rely on Hyland-Ong innocent games. They provide a model to per-form the usual infinitary reasoning on Bar-Recursion needed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011